# Given two sentences words1, words2 (each represented as an array of strings),
# and a list of similar word pairs pairs, determine if two sentences are similar.
#
# For example, "great acting skills" and "fine drama talent" are similar,
# if the similar word pairs are pairs = [["great", "fine"], ["acting","drama"], ["skills","talent"]].
#
# Note that the similarity relation is not transitive. For example,
# if "great" and "fine" are similar, and "fine" and "good" are similar,
# "great" and "good" are not necessarily similar.
#
# However, similarity is symmetric. For example, "great" and "fine"
# being similar is the same as "fine" and "great" being similar.
#
# Also, a word is always similar with itself. For example, the sentences
# words1 = ["great"], words2 = ["great"], pairs = [] are similar, even though
# there are no specified similar word pairs.
#
# Finally, sentences can only be similar if they have the same number of words.
# So a sentence like words1 = ["great"] can never be similar to words2 = ["doubleplus","good"].


class Solution:
    def areSentencesSimilar(self, words1, words2, pairs):

        if len(words1) != len(words2):
            return False

        for i in range(len(words1)):

            arr = [words1[i], words2[i]]
            arr_rev = [words2[i], words1[i]]

            if arr not in pairs and arr_rev not in pairs:
                if words1[i] != words2[i]:
                    return False

        return True
